Video Encryption Based on Data Partitioning and Scalable Coding - A Comparison

نویسندگان

  • Thomas Kunkelmann
  • Uwe Horn
چکیده

Many of today's multimedia applications require con dential video transmission over the Internet. Appropriate encryption methods require a high computational complexity and are likely to become a performance bottleneck within software-only applications. To reduce the computational encryption e ort, partial video encryption methods have been proposed in the past. Promising approaches are based on data partitioning where the encoded video stream is partitioned into two streams, one containing the most important data, the other one containing the least important data. Encrypting the most important data only can reduce the required computational complexity to 10 50 % compared to encryption of the whole data stream. Besides the known standardized DCT based video codecs, scalable codecs become more and more popular. Scalable codecs have the advantage that no additional e ort is needed to obtain the required data partitioning. In this paper, a novel approach to partial video encryption based on data partitioning applicable to every DCT-based video codec is presented. It is compared to base layer encryption of a video stream encoded with a scalable codec based on a spatio-temporal resolution pyramid. Besides partial encryption, transparent encryption is discussed as well.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

No Tradeoff between Confidentiality and Performance: An Analysis on H.264/SVC Partial Encryption

Partial encryption is often used as a tradeoff between security and performance to protect scalable video data. In this paper, we argue that although partial encryption is strong enough for access control, it is not adequate for content confidentiality protection. We conduct experiments to show that partially encrypted H.264/SVC (scalable video coding) streams leak significant content informati...

متن کامل

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

Secure Scalable Video Compression for GVid

GVid is a Grid service that enables the secure and transparent integration and development of graphical user interface applications in the Grid. It separates the potentially computationally complex task of data creation and visualization, e.g., scientific simulations, from the comparably computationally inexpensive task of transmission and display of the visual data. A Grid application produces...

متن کامل

Low bit-rate scalable video coding with 3-D set partitioning in hierarchical trees (3-D SPIHT)

In this paper, we propose a low bit-rate embedded video coding scheme that utilizes a three-dimensional (3D) extension of the set partitioning in hierarchical trees (SPIHT) algorithm which has proved so successful in still image coding. Three-dimensional spatio-temporal orientation trees coupled with powerful SPIHT sorting and reenement renders 3D SPIHT video coder so eecient that it provides c...

متن کامل

Fast Intra Mode Decision for Depth Map coding in 3D-HEVC Standard

three dimensional- high efficiency video coding (3D-HEVC) is the expanded version of the latest video compression standard, namely high efficiency video coding (HEVC), which is used to compress 3D videos. 3D videos include texture video and depth map. Since the statistical characteristics of depth maps are different from those of texture videos, new tools have been added to the HEVC standard fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998